A new principle in the interpretability logic of all reasonable arithmetical theories
نویسندگان
چکیده
This paper is a presentation of a status qu stionis, to wit of the problem of the interpretability logic of all reasonable arithmetical theories. We present both the arithmetical side and the modal side of the question.
منابع مشابه
Modal Matters in Interpretability Logics
In this paper we expose a method for building models for interpretability logics. The method can be compared to the method of taking unions of chains in classical model theory. Many applications of the method share a common part. We isolate this common part in a main lemma. Doing so, many of our results become applications of this main lemma. We also briefly describe how our method can be gener...
متن کاملInterpretability in PRA
In this paper we study IL(PRA), the interpretability logic of PRA. As PRA is neither an essentially reflexive theory nor finitely axiomatizable, the two known arithmetical completeness results do not apply to PRA: IL(PRA) is not ILM or ILP. IL(PRA) does of course contain all the principles known to be part of IL(All), the interpretability logic of the principles common to all reasonable arithme...
متن کاملInterpretability Logic
This is an overview a study of interpretability logic in Zagreb for the last twenty years: a brief history and some planes for further research. The idea of treating a provability predicate as a modal operator goes back to Gödel. The same idea was taken up later by Kripke and Montague, but only in the mid–seventies was the correct choice of axioms, based on Löb’s theorem, seriously considered b...
متن کاملUnary Interpretability Logic
Let T be an arithmetical theory. We introduce a unary modal operator T to be interpreted arithmetically as the unary interpretability predicate over T. We present complete axiomatizations of the (unary) interpretability principles underlying two important classes of theories. We also prove some basic modal results about these new axiomatizations.
متن کاملA note on the interpretability logic of finitely axiomatized theories
Ill [6] Albert Visser shows that ILP completely axiomatizes all schemata about provabihty and relative interpretability that are prov-able in finitely axiomatized theories. In this paper we introduce a system called ILP ~ that completely axiomatizes the arithmetically valid principles of provability in and interpretabihty over such theories. To prove the arith-metical completeness of ILP ~ we u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logic Journal of the IGPL
دوره 19 شماره
صفحات -
تاریخ انتشار 2011